0.12/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.12/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n023.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Thu Jul 4 06:58:09 EDT 2024 0.12/0.33 % CPUTime : 0.21/0.47 Running higher-order theorem proving 0.21/0.47 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.1Sh488n6pT/E---3.1_32484.p 0.21/0.49 # Version: 3.2.0-ho 0.21/0.49 # Preprocessing class: HSSSSMSSSLMNSFA. 0.21/0.49 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.49 # Starting new_ho_10 with 900s (5) cores 0.21/0.49 # Starting ho_unfolding_6 with 180s (1) cores 0.21/0.49 # Starting sh4l with 180s (1) cores 0.21/0.49 # Starting lpo8_s with 180s (1) cores 0.21/0.49 # lpo8_s with pid 32637 completed with status 0 0.21/0.49 # Result found by lpo8_s 0.21/0.49 # Preprocessing class: HSSSSMSSSLMNSFA. 0.21/0.49 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.49 # Starting new_ho_10 with 900s (5) cores 0.21/0.49 # Starting ho_unfolding_6 with 180s (1) cores 0.21/0.49 # Starting sh4l with 180s (1) cores 0.21/0.49 # Starting lpo8_s with 180s (1) cores 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0) 0.21/0.49 # Search class: HHUNF-FFSM32-SSFFMFBN 0.21/0.49 # partial match(3): HHUSF-FFSF22-SSFFMFBN 0.21/0.49 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.21/0.49 # Starting new_ho_10 with 98s (1) cores 0.21/0.49 # new_ho_10 with pid 32641 completed with status 0 0.21/0.49 # Result found by new_ho_10 0.21/0.49 # Preprocessing class: HSSSSMSSSLMNSFA. 0.21/0.49 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.21/0.49 # Starting new_ho_10 with 900s (5) cores 0.21/0.49 # Starting ho_unfolding_6 with 180s (1) cores 0.21/0.49 # Starting sh4l with 180s (1) cores 0.21/0.49 # Starting lpo8_s with 180s (1) cores 0.21/0.49 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0) 0.21/0.49 # Search class: HHUNF-FFSM32-SSFFMFBN 0.21/0.49 # partial match(3): HHUSF-FFSF22-SSFFMFBN 0.21/0.49 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.21/0.49 # Starting new_ho_10 with 98s (1) cores 0.21/0.49 # Preprocessing time : 0.001 s 0.21/0.49 # Presaturation interreduction done 0.21/0.49 0.21/0.49 # Proof found! 0.21/0.49 # SZS status Theorem 0.21/0.49 # SZS output start CNFRefutation 0.21/0.49 thf(decl_22, type, in: $i > $i > $o). 0.21/0.49 thf(decl_23, type, subset: $i > $i > $o). 0.21/0.49 thf(decl_24, type, kpair: $i > $i > $i). 0.21/0.49 thf(decl_25, type, cartprod: $i > $i > $i). 0.21/0.49 thf(decl_26, type, breln: $i > $i > $i > $o). 0.21/0.49 thf(decl_27, type, dpsetconstr: $i > $i > ($i > $i > $o) > $i). 0.21/0.49 thf(decl_28, type, dpsetconstrI: $o). 0.21/0.49 thf(decl_29, type, breln1: $i > $i > $o). 0.21/0.49 thf(decl_30, type, breln1compset: $i > $i > $i > $i). 0.21/0.49 thf(decl_31, type, esk1_0: $i). 0.21/0.49 thf(decl_32, type, esk2_0: $i). 0.21/0.49 thf(decl_33, type, esk3_0: $i). 0.21/0.49 thf(decl_34, type, esk4_0: $i). 0.21/0.49 thf(decl_35, type, esk5_0: $i). 0.21/0.49 thf(decl_36, type, esk6_0: $i). 0.21/0.49 thf(decl_37, type, epred1_0: $i > $i > $o). 0.21/0.49 thf(decl_38, type, esk7_2: $i > $i > $i). 0.21/0.49 thf(breln1, axiom, ((breln1)=(^[X1:$i, X9:$i]:((breln @ X1 @ X1 @ X9)))), file('/export/starexec/sandbox/tmp/tmp.1Sh488n6pT/E---3.1_32484.p', breln1)). 0.21/0.49 thf(breln, axiom, ((breln)=(^[X1:$i, X2:$i, X3:$i]:((subset @ X3 @ (cartprod @ X1 @ X2))))), file('/export/starexec/sandbox/tmp/tmp.1Sh488n6pT/E---3.1_32484.p', breln)). 0.21/0.49 thf(dpsetconstrI, axiom, ((dpsetconstrI)<=>![X1:$i, X2:$i, X4:$i > $i > $o, X5:$i]:(((in @ X5 @ X1)=>![X6:$i]:(((in @ X6 @ X2)=>((X4 @ X5 @ X6)=>(in @ (kpair @ X5 @ X6) @ (dpsetconstr @ X1 @ X2 @ (^[X7:$i, X8:$i]:((X4 @ X7 @ X8))))))))))), file('/export/starexec/sandbox/tmp/tmp.1Sh488n6pT/E---3.1_32484.p', dpsetconstrI)). 0.21/0.49 thf(breln1compset, axiom, ((breln1compset)=(^[X1:$i, X9:$i, X10:$i]:(dpsetconstr @ X1 @ X1 @ (^[X5:$i, X6:$i]:(?[X7:$i]:((((in @ X7 @ X1)&(in @ (kpair @ X5 @ X7) @ X9))&(in @ (kpair @ X7 @ X6) @ X10)))))))), file('/export/starexec/sandbox/tmp/tmp.1Sh488n6pT/E---3.1_32484.p', breln1compset)). 0.21/0.49 thf(breln1compI, conjecture, ((dpsetconstrI)=>![X1:$i, X9:$i]:(((breln1 @ X1 @ X9)=>![X10:$i]:(((breln1 @ X1 @ X10)=>![X5:$i]:((![X6:$i]:(((in @ X6 @ X1)=>![X7:$i]:(((in @ X7 @ X1)=>((in @ (kpair @ X5 @ X7) @ X9)=>((in @ (kpair @ X5 @ X6) @ (breln1compset @ X1 @ X9 @ X10))<=(in @ (kpair @ X7 @ X6) @ X10)))))))<=(in @ X5 @ X1)))))))), file('/export/starexec/sandbox/tmp/tmp.1Sh488n6pT/E---3.1_32484.p', breln1compI)). 0.21/0.49 thf(c_0_5, plain, ((breln1)=(^[Z0/* 19 */:$i, Z1:$i]:(((subset @ Z1 @ (cartprod @ Z0 @ Z0)))))), inference(fof_simplification,[status(thm)],[breln1])). 0.21/0.49 thf(c_0_6, plain, ((breln)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((subset @ Z2 @ (cartprod @ Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[breln])). 0.21/0.49 thf(c_0_7, plain, ((dpsetconstrI)<=>![X1:$i, X2:$i, X4:$i > $i > $o, X5:$i]:(((in @ X5 @ X1)=>![X6:$i]:(((in @ X6 @ X2)=>((X4 @ X5 @ X6)=>(in @ (kpair @ X5 @ X6) @ (dpsetconstr @ X1 @ X2 @ (^[Z0/* 19 */:$i, Z1:$i]:((X4 @ Z0 @ Z1))))))))))), inference(fof_simplification,[status(thm)],[dpsetconstrI])). 0.21/0.49 thf(c_0_8, plain, ((breln1)=(^[Z0/* 19 */:$i, Z1:$i]:(((subset @ Z1 @ (cartprod @ Z0 @ Z0)))))), inference(apply_def,[status(thm)],[c_0_5, c_0_6])). 0.21/0.49 thf(c_0_9, plain, ((breln1compset)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(dpsetconstr @ Z0 @ Z0 @ (^[Z3/* 19 */:$i, Z4:$i]:(?[X7:$i]:((((in @ X7 @ Z0)&(in @ (kpair @ Z3 @ X7) @ Z1))&(in @ (kpair @ X7 @ Z4) @ Z2)))))))), inference(fof_simplification,[status(thm)],[breln1compset])). 0.21/0.49 thf(c_0_10, negated_conjecture, ~((![X22:$i, X23:$i, X24:$i > $i > $o, X25:$i]:(((in @ X25 @ X22)=>![X26:$i]:(((in @ X26 @ X23)=>((X24 @ X25 @ X26)=>(in @ (kpair @ X25 @ X26) @ (dpsetconstr @ X22 @ X23 @ X24)))))))=>![X1:$i, X9:$i]:(((subset @ X9 @ (cartprod @ X1 @ X1))=>![X10:$i]:(((subset @ X10 @ (cartprod @ X1 @ X1))=>![X5:$i]:(((in @ X5 @ X1)=>![X6:$i]:(((in @ X6 @ X1)=>![X7:$i]:(((in @ X7 @ X1)=>((in @ (kpair @ X5 @ X7) @ X9)=>((in @ (kpair @ X7 @ X6) @ X10)=>(in @ (kpair @ X5 @ X6) @ (dpsetconstr @ X1 @ X1 @ (^[Z0/* 19 */:$i, Z1:$i]:(?[X27:$i]:((((in @ X27 @ X1)&(in @ (kpair @ Z0 @ X27) @ X9))&(in @ (kpair @ X27 @ Z1) @ X10))))))))))))))))))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1compI]), c_0_7]), c_0_8]), c_0_9])])])). 0.21/0.49 thf(c_0_11, negated_conjecture, ![X28:$i, X29:$i, X30:$i > $i > $o, X31:$i, X32:$i]:(((~(in @ X31 @ X28)|(~(in @ X32 @ X29)|(~(X30 @ X31 @ X32)|(in @ (kpair @ X31 @ X32) @ (dpsetconstr @ X28 @ X29 @ X30)))))&((subset @ esk2_0 @ (cartprod @ esk1_0 @ esk1_0))&((subset @ esk3_0 @ (cartprod @ esk1_0 @ esk1_0))&((in @ esk4_0 @ esk1_0)&((in @ esk5_0 @ esk1_0)&((in @ esk6_0 @ esk1_0)&((in @ (kpair @ esk4_0 @ esk6_0) @ esk2_0)&((in @ (kpair @ esk6_0 @ esk5_0) @ esk3_0)&~(in @ (kpair @ esk4_0 @ esk5_0) @ (dpsetconstr @ esk1_0 @ esk1_0 @ (^[Z0/* 19 */:$i, Z1:$i]:(?[X27:$i]:((((in @ X27 @ esk1_0)&(in @ (kpair @ Z0 @ X27) @ esk2_0))&(in @ (kpair @ X27 @ Z1) @ esk3_0)))))))))))))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])])). 0.21/0.49 thf(c_0_12, plain, ![X41:$i, X40:$i]:(((epred1_0 @ X40 @ X41)<=>?[X39:$i]:((((in @ X39 @ esk1_0)&(in @ (kpair @ X40 @ X39) @ esk2_0))&(in @ (kpair @ X39 @ X41) @ esk3_0))))), introduced(definition)). 0.21/0.49 thf(c_0_13, plain, ![X42:$i, X43:$i, X45:$i]:((((((in @ (esk7_2 @ X42 @ X43) @ esk1_0)|~(epred1_0 @ X43 @ X42))&((in @ (kpair @ X43 @ (esk7_2 @ X42 @ X43)) @ esk2_0)|~(epred1_0 @ X43 @ X42)))&((in @ (kpair @ (esk7_2 @ X42 @ X43) @ X42) @ esk3_0)|~(epred1_0 @ X43 @ X42)))&(~(in @ X45 @ esk1_0)|~(in @ (kpair @ X43 @ X45) @ esk2_0)|~(in @ (kpair @ X45 @ X42) @ esk3_0)|(epred1_0 @ X43 @ X42)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])])])). 0.21/0.49 thf(c_0_14, negated_conjecture, ~((((in @ (kpair @ esk4_0 @ esk5_0) @ (dpsetconstr @ esk1_0 @ esk1_0 @ epred1_0)))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_11]), c_0_12])). 0.21/0.49 thf(c_0_15, plain, ![X1:$i, X2:$i, X3:$i]:(((epred1_0 @ X2 @ X3)|~((in @ X1 @ esk1_0))|~((in @ (kpair @ X2 @ X1) @ esk2_0))|~((in @ (kpair @ X1 @ X3) @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.21/0.49 thf(c_0_16, negated_conjecture, (in @ (kpair @ esk4_0 @ esk6_0) @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_11])). 0.21/0.49 thf(c_0_17, negated_conjecture, (in @ esk6_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_11])). 0.21/0.49 thf(c_0_18, negated_conjecture, ~((in @ (kpair @ esk4_0 @ esk5_0) @ (dpsetconstr @ esk1_0 @ esk1_0 @ epred1_0))), inference(cn,[status(thm)],[c_0_14])). 0.21/0.49 thf(c_0_19, negated_conjecture, ![X2:$i, X1:$i, X5:$i, X4:$i > $i > $o, X3:$i]:(((in @ (kpair @ X1 @ X3) @ (dpsetconstr @ X2 @ X5 @ X4))|~((in @ X1 @ X2))|~((in @ X3 @ X5))|~((X4 @ X1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_11])). 0.21/0.49 thf(c_0_20, negated_conjecture, (in @ esk5_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_11])). 0.21/0.49 thf(c_0_21, negated_conjecture, (in @ esk4_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_11])). 0.21/0.49 thf(c_0_22, negated_conjecture, ![X1:$i]:(((epred1_0 @ esk4_0 @ X1)|~((in @ (kpair @ esk6_0 @ X1) @ esk3_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])])). 0.21/0.49 thf(c_0_23, negated_conjecture, (in @ (kpair @ esk6_0 @ esk5_0) @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_11])). 0.21/0.49 thf(c_0_24, negated_conjecture, ~((epred1_0 @ esk4_0 @ esk5_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20]), c_0_21])])). 0.21/0.49 thf(c_0_25, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24]), ['proof']). 0.21/0.49 # SZS output end CNFRefutation 0.21/0.49 # Parsed axioms : 14 0.21/0.49 # Removed by relevancy pruning/SinE : 9 0.21/0.49 # Initial clauses : 13 0.21/0.49 # Removed in clause preprocessing : 0 0.21/0.49 # Initial clauses in saturation : 13 0.21/0.49 # Processed clauses : 30 0.21/0.49 # ...of these trivial : 0 0.21/0.49 # ...subsumed : 0 0.21/0.49 # ...remaining for further processing : 29 0.21/0.49 # Other redundant clauses eliminated : 0 0.21/0.49 # Clauses deleted for lack of memory : 0 0.21/0.49 # Backward-subsumed : 0 0.21/0.49 # Backward-rewritten : 0 0.21/0.49 # Generated clauses : 5 0.21/0.49 # ...of the previous two non-redundant : 4 0.21/0.49 # ...aggressively subsumed : 0 0.21/0.49 # Contextual simplify-reflections : 1 0.21/0.49 # Paramodulations : 5 0.21/0.49 # Factorizations : 0 0.21/0.49 # NegExts : 0 0.21/0.49 # Equation resolutions : 0 0.21/0.49 # Disequality decompositions : 0 0.21/0.49 # Total rewrite steps : 3 0.21/0.49 # ...of those cached : 0 0.21/0.49 # Propositional unsat checks : 0 0.21/0.49 # Propositional check models : 0 0.21/0.49 # Propositional check unsatisfiable : 0 0.21/0.49 # Propositional clauses : 0 0.21/0.49 # Propositional clauses after purity: 0 0.21/0.49 # Propositional unsat core size : 0 0.21/0.49 # Propositional preprocessing time : 0.000 0.21/0.49 # Propositional encoding time : 0.000 0.21/0.49 # Propositional solver time : 0.000 0.21/0.49 # Success case prop preproc time : 0.000 0.21/0.49 # Success case prop encoding time : 0.000 0.21/0.49 # Success case prop solver time : 0.000 0.21/0.49 # Current number of processed clauses : 16 0.21/0.49 # Positive orientable unit clauses : 7 0.21/0.49 # Positive unorientable unit clauses: 0 0.21/0.49 # Negative unit clauses : 2 0.21/0.49 # Non-unit-clauses : 7 0.21/0.49 # Current number of unprocessed clauses: 0 0.21/0.49 # ...number of literals in the above : 0 0.21/0.49 # Current number of archived formulas : 0 0.21/0.49 # Current number of archived clauses : 13 0.21/0.49 # Clause-clause subsumption calls (NU) : 8 0.21/0.49 # Rec. Clause-clause subsumption calls : 2 0.21/0.49 # Non-unit clause-clause subsumptions : 1 0.21/0.49 # Unit Clause-clause subsumption calls : 1 0.21/0.49 # Rewrite failures with RHS unbound : 0 0.21/0.49 # BW rewrite match attempts : 0 0.21/0.49 # BW rewrite match successes : 0 0.21/0.49 # Condensation attempts : 30 0.21/0.49 # Condensation successes : 0 0.21/0.49 # Termbank termtop insertions : 1608 0.21/0.49 # Search garbage collected termcells : 502 0.21/0.49 0.21/0.49 # ------------------------------------------------- 0.21/0.49 # User time : 0.006 s 0.21/0.49 # System time : 0.002 s 0.21/0.49 # Total time : 0.008 s 0.21/0.49 # Maximum resident set size: 1912 pages 0.21/0.49 0.21/0.49 # ------------------------------------------------- 0.21/0.49 # User time : 0.007 s 0.21/0.49 # System time : 0.004 s 0.21/0.49 # Total time : 0.011 s 0.21/0.49 # Maximum resident set size: 1732 pages 0.21/0.49 % E---3.1 exiting 0.21/0.49 % E exiting 0.21/0.49 EOF